Relations between the diagonal elements of two mutually inverse positive definite matrices
نویسندگان
چکیده
منابع مشابه
Geometrical Inverse Preconditioning for Symmetric Positive Definite Matrices
We focus on inverse preconditioners based on minimizing F(X) = 1− cos(XA, I), where XA is the preconditioned matrix and A is symmetric and positive definite. We present and analyze gradient-type methods to minimize F(X) on a suitable compact set. For this, we use the geometrical properties of the non-polyhedral cone of symmetric and positive definite matrices, and also the special properties of...
متن کاملA Sparse Approximate Inverse Preconditioner for Nonsymmetric Positive Definite Matrices
We develop an algorithm for computing a sparse approximate inverse for a nonsymmetric positive definite matrix based upon the FFAPINV algorithm. The sparse approximate inverse is computed in the factored form and used to work with some Krylov subspace methods. The preconditioner is breakdown free and, when used in conjunction with Krylovsubspace-based iterative solvers such as the GMRES algorit...
متن کاملA Note on Estimates of Diagonal Elements of the Inverse of Diagonally Dominant Tridiagonal Matrices
In this note we show how to improve some recent upper and lower bounds for the elements of the inverse of diagonally dominant tridiagonal matrices. In particular, a technique described by [R. Peluso, and T. Politi, Some improvements on two-sided bounds on the inverse of diagonally dominant tridiagonal matrices, Lin. Alg. Appl. Vol. 330 (2001) 1-14], is used to obtain better bounds for the diago...
متن کاملGyrovector Spaces on the Open Convex Cone of Positive Definite Matrices
In this article we review an algebraic definition of the gyrogroup and a simplified version of the gyrovector space with two fundamental examples on the open ball of finite-dimensional Euclidean spaces, which are the Einstein and M"{o}bius gyrovector spaces. We introduce the structure of gyrovector space and the gyroline on the open convex cone of positive definite matrices and explore its...
متن کاملA Levinson-like algorithm for symmetric positive definite semiseparable plus diagonal matrices
In this paper a Levinson-like algorithm is derived for solving symmetric positive definite semiseparable plus diagonal systems of equations. In a first part we solve a Yule-Walker-like system of equations. Based on this O(n) solver an algorithm for a general right-hand side is derived. The new method has a linear complexity and takes 19n − 13 operations. The relation between the algorithm and a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1964
ISSN: 0011-4642,1572-9141
DOI: 10.21136/cmj.1964.100600